Complexity of constraint satisfaction

Results: 53



#Item
41Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,

Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,

Add to Reading List

Source URL: www.nlsde.buaa.edu.cn

Language: English - Date: 2007-04-10 23:13:08
42Constraints manuscript No. (will be inserted by the editor) On Matrices, Automata, and Double Counting in Constraint Programming Nicolas Beldiceanu · Mats Carlsson · Pierre

Constraints manuscript No. (will be inserted by the editor) On Matrices, Automata, and Double Counting in Constraint Programming Nicolas Beldiceanu · Mats Carlsson · Pierre

Add to Reading List

Source URL: www.it.uu.se

Language: English - Date: 2012-11-22 04:43:49
43Intractability and Clustering with Constraints  Ian Davidson [removed] S.S. Ravi [removed]

Intractability and Clustering with Constraints Ian Davidson [removed] S.S. Ravi [removed]

Add to Reading List

Source URL: www.machinelearning.org

Language: English - Date: 2008-12-01 11:26:24
44Conference on ALGORITHMIC COMPLEXITY AND UNIVERSAL ALGEBRA Dedicated to the 75th birthday of B´ela Cs´ ak´ any Szeged, Hungary, July 16–20, 2007

Conference on ALGORITHMIC COMPLEXITY AND UNIVERSAL ALGEBRA Dedicated to the 75th birthday of B´ela Cs´ ak´ any Szeged, Hungary, July 16–20, 2007

Add to Reading List

Source URL: www.math.u-szeged.hu

Language: English - Date: 2007-07-20 11:46:40
45Dichotomy Theorems for Counting Problems  Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-11 20:52:11
46Non-negative Weighted #CSPs: An Effective Complexity Dichotomy  Jin-Yi Cai University of Wisconsin, Madison  Xi Chen

Non-negative Weighted #CSPs: An Effective Complexity Dichotomy Jin-Yi Cai University of Wisconsin, Madison Xi Chen

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 13:52:31
47A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer  Geoffrey J. Gordon

A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer Geoffrey J. Gordon

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2013-11-06 19:31:44
48Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009

Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-11-30 17:57:22
49Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2005-06-22 08:43:27